What’s New in Polyomino Puzzles and Their Design
نویسندگان
چکیده
The idea of using sets of polyominoes as practical assembly puzzles can be traced back more than two and a half centuries. Les Amusmens, published in 1749, included a cross puzzle made of three Z-pentominoes and two L-polyominoes. The earliest rectangular puzzle formed from polyominoes that we found, named The Jags and Hooks Puzzle, was included in Catel’s Catalogue of 1785 [1]. It consisted of four L-tetrominoes and four Z-pentominoes and the only solution is shown in Figure 1.
منابع مشابه
Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and ComplexityA preliminary version of this paper was presented at the Gathering for Gardner 6, Atlanta, March 2004
We show that jigsaw puzzles, edge-matching puzzles, and polyomino packing puzzles are all NP-complete. Furthermore, we show direct equivalences between these three types of puzzles: any puzzle of one type can be converted into an equivalent puzzle of any other type.
متن کاملThe impact of using problem-solving puzzles on Iranian intermediate EFL learners' lexical knowledge
This study tried to investigate the impact of using problem-solving puzzles onIranian Intermediate EFL learners' lexical knowledge. At first a homogenoussample of 30 Intermediate EFL learners attending in the third grade of Shahedhigh school in Lahijan were selected and they were randomly divided into twogroups, as experimental group and control group. In the first session, the pretestwas admin...
متن کاملOn Jigsaw Sudoku Puzzles and Related Topics Bachelor Thesis
Using memoization and various other optimization techniques, the number of dissections of the n × n square into n polyominoes of size n is computed for n ≤ 8. On this task our method outperforms Donald Knuth’s Algorithm X with Dancing Links. The number of jigsaw sudoku puzzle solutions is computed for n ≤ 7. For every jigsaw sudoku puzzle polyomino cover with n ≤ 6 the size of its smallest crit...
متن کاملA note on polyomino chains with extremum general sum-connectivity index
The general sum-connectivity index of a graph $G$ is defined as $chi_{alpha}(G)= sum_{uvin E(G)} (d_u + d_{v})^{alpha}$ where $d_{u}$ is degree of the vertex $uin V(G)$, $alpha$ is a real number different from $0$ and $uv$ is the edge connecting the vertices $u,v$. In this note, the problem of characterizing the graphs having extremum $chi_{alpha}$ values from a certain collection of polyomino ...
متن کاملWinning Strategies for Hexagonal Polyomino Achievement
In polyomino achievement games, two players alternately mark the cells of a tessellation and try to achieve a given polyomino. In [2], Bode and Harborth investigated polyomino achievement games for the hexagonal tessellation and determined all but five polyominoes with at most five cells whether they are achieved by the first player. In this paper, we show winning strategies for three hexagonal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006